Forcing axioms and inner models of set theory
نویسندگان
چکیده
منابع مشابه
Descriptive Inner Model Theory , Large Cardinals , and Combinatorics Research Statement Nam Trang
My research interest is in mathematical logic and set theory. My current research focuses on studying the connections between inner models, (determined) sets of reals, hybrid structures (such as HOD1 of determinacy models), forcing, and strong combinatorial principles (such as the Proper Forcing Axiom (PFA), (generalizations of) the tree property, the Unique Branch Hypothesis (UBH)). I’m also i...
متن کاملForcing Axioms and Cardinal Arithmetic
We survey some recent results on the impact of strong forcing axioms such as the Proper Forcing Axiom PFA and Martin’s Maximum MM on cardinal arithmetic. We concentrate on three combinatorial principles which follow from strong forcing axioms: stationary set reflection, Moore’s Mapping Reflection Principle MRP and the P-ideal dichotomy introduced by Abraham and Todorčević which play the key rol...
متن کاملForcing indestructibility of set-theoretic axioms
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to א1. Later we give applications, among them the c...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006